Secure Introduction of One-Way Functions
نویسنده
چکیده
Conditions are given under which a one-way function can be used safely in a programming language. The security proof involves showing that secrets cannot be leaked easily by any program meeting the conditions unless breaking the one-way function is easy. The result is applied to a password system where passwords are stored in a public file as images under a one-way function.1
منابع مشابه
Introduction to Cryptography November 2 , 2006 Lecture 20 : Digital Signatures II
In the last lecture, we developed a digital signature scheme for message in {0, 1} n and proved it to be one-time secure. We also showed how to construct a family of Collision-Resistant Hash Functions (CRH) and claimed that they would be useful in constructing one-time secure digital signature schemes for messages in {0, 1} *. The following theorem makes this claim more formally. Theorem 1 If t...
متن کاملCorrelated Product Security From Any One-Way Function and the New Notion of Decisional Correlated Product Security
It is well-known that the k-wise product of one-way functions remains one-way, but may no longer be when the k inputs are correlated. At TCC 2009, Rosen and Segev introduced a new notion known as Correlated Product secure functions. These functions have the property that a k-wise product of them remains one-way even under correlated inputs. Rosen and Segev gave a construction of injective trapd...
متن کاملProvably Secure One-Way Hash Functions
This paper surveys recent progress on the construction of provably secure one-way hash functions, under gradually weakened assumptions. One-way hash functions have many cryptographic applications. In digital signatures, they are used to compress long input strings prior to actual signing procedures. This usually greatly improves the overall efficiency of a signature scheme. They are also used t...
متن کاملWeak Oblivious Transfer from Strong One-Way Functions
We consider weak oblivious transfer (OT) from strong one-way functions and the paradigm of transforming unconditionally secure protocols in Maurer’s bounded storage model into computational secure protocols in the random oracle model. Weak OT is secure against adversaries which have a quadratic resource gap to honest parties. We prove that the random oracle can be replaced with strong one-way f...
متن کاملSuccinct Garbling Schemes and Applications
Assuming the existence of iO for P/poly and one-way functions, we show how to succinctly garble bounded-space computations (BSC) M : the size of the garbled program (as well as the time needed to generate the garbling) only depends on the size and space (including the input and output) complexity of M , but not its running time. The key conceptual insight behind this construction is a method fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000